Bordered Conjugates of Words over Large Alphabets
نویسندگان
چکیده
The border correlation function attaches to every word w a binary word β(w) of the same length where the ith letter tells whether the ith conjugate w′ = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of the word w. We show that for a 3-letter alphabet A, the set of β-images equals β(An) = B∗ \ ([ abn−1 ] ∪D ) where D = {an} if n ∈ {5, 7, 9, 10, 14, 17}, and otherwise D = ∅. Hence the number of β-images is Bn 3 = 2 n − n−m, where m = 1 if n ∈ {5, 7, 9, 10, 14, 17} and m = 0 otherwise.
منابع مشابه
Border Correlations of Partial
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ◊’s. Setting = A ∪ {◊}, denotes the set of all partial words over A. In this paper, we investigate the border correlation function β: → {a, b} that specifies which conjugates (cyclic shifts) of a given partial word w of length n are bordered, that is, β (w) = c0c1 ... cn−1 w...
متن کاملFully bordered words
Any primitive binary word contains at least two unbordered conjugates. We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes. In this paper we relate two elementary properties of finite words: being a palin-drome and being unbordered. These two concepts are in a sense complementary. Unbordered words have maxi...
متن کاملUnbordered factors and Lyndon words
A primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to some lexicographic order. A word w is bordered if there is a nonempty word u such that w = uvu for some word v. A right extension of a word w of length n is a word wu where all factors longer than n are bordered. A right extension wu of w is called trivial if there exists a positive integer k such that ...
متن کاملBorder correlation of binary words
The border correlation function β : A → A, for A = {a, b}, specifies which conjugates (cyclic shifts) of a given word w of length n are bordered, i.e., β(w) = b0b1 . . . bn−1, where bi = a or b according to whether the i-th cyclic shift σ(w) of w is unbordered or bordered. Except for some special cases, no binary word w has two consecutive unbordered conjugates (σ(w) and σ(w)). We show that thi...
متن کاملInvolutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008